Sequence of polyhedral relaxations for nonlinear univariate functions
نویسندگان
چکیده
منابع مشابه
Combining Semidefinite and Polyhedral Relaxations for Integer Programs
We present a general framework for designing semideenite relaxations for constrained 0-1 quadratic programming and show how valid inequalities of the cut{polytope can be used to strengthen these relaxations. As examples we improve the #{function and give a semidef-inite relaxation for the quadratic knapsack problem. The practical value of this approach is supported by numerical experiments whic...
متن کاملA Note on Polyhedral Relaxations for the Maximum Cut Problem
We consider three well-studied polyhedral relaxations for the maximum cut problem: the metric polytope of the complete graph, the metric polytope of a general graph, and the relaxation of the bipartite subgraph polytope. The metric polytope of the complete graph can be described with a polynomial number of inequalities, while the latter two may require exponentially many constraints. We give an...
متن کاملA Method for Designing Nonlinear Univariate Calibration
A method is proposed for designing nonlinear univariate calibration of measuring instruments. The problem addressed is how to select a set of design points (standards or calibrators) to minimize the errors in the inverse predictions. The curve parameters are assumed to vary randomly between calibrations, with known expected value and known covariance matrix. A design criterion is suggested for ...
متن کاملDetecting integral polyhedral functions
We study the class of real-valued functions on convex subsets of Rn which are computed by the maximum of finitely many affine functionals with integer slopes. We prove several results to the effect that this property of a function can be detected by sampling on small subsets of the domain. In so doing, we recover in a unified way some prior results of the first author (some joint with Liang Xia...
متن کاملA hierarchy of relaxations for nonlinear convex generalized disjunctive programming
We propose a framework to generate alternative mixed-integer nonlinear programming formulations for disjunctive convex programs that lead to stronger relaxations. We extend the concept of “basic steps” defined for disjunctive linear programs to the nonlinear case. A basic step is an operation that takes a disjunctive set to another with fewer number of conjuncts. We show that the strength of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization and Engineering
سال: 2021
ISSN: 1389-4420,1573-2924
DOI: 10.1007/s11081-021-09609-z